An Efficient Hamiltonian for Discrete Fractional Fourier Transform
نویسندگان
چکیده
Fractional Fourier Transform, which is a generalization of the classical Fourier Transform, is a powerful tool for the analysis of transient signals. The discrete Fractional Fourier Transform Hamiltonians have been proposed in the past with varying degrees of correlation between their eigenvectors and Hermite Gaussian functions. In this paper, we propose a new Hamiltonian for the discrete Fractional Fourier Transform and show that the eigenvectors of the proposed matrix has a higher degree of correlation with the Hermite Gaussian functions. Also, the proposed matrix is shown to give better Fractional Fourier responses with various transform orders for different signals. Keywords— Fractional Fourier Transform, Hamiltonian, Eigen Vectors, Discrete Hermite Gaussians.
منابع مشابه
Implementation of Discrete Fractional Fourier Transform for Signal Compression
An efficient method for implementing closed form discrete fractional Fourier transform for the purpose of signal compression is presented. Implementation method is compared with that of existing closed form discrete fractional Fourier transform, with respect to computational complexity, variance of quantization error, signal to noise ratio and number of bits for the representation of coefficien...
متن کاملDigital Computation of the Fractional Fourier Transform - Signal Processing, IEEE Transactions on
An algorithm for efficient and accurate computation of the fractional Fourier transform is given. For signals with time-bandwidth product N , the presented algorithm computes the fractional transform in O( N log N ) time. A definition for the discrete fractional Fourier transform that emerges from our analysis is also discussed.
متن کاملSampling Rate Conversion in the Discrete Linear Canonical Transform Domain
Sampling rate conversion (SRC) is one of important issues in modern sampling theory. It can be realized by up-sampling, filtering, and down-sampling operations, which need large complexity. Although some efficient algorithms have been presented to do the sampling rate conversion, they all need to compute the N-point original signal to obtain the up-sampling or the down-sampling signal in the tim...
متن کاملDigital computation of the fractional Fourier transform
An algorithm for efficient and accurate computation of the fractional Fourier transform is given. For signals with time-bandwidth product N , the presented algorithm computes the fractional transform in O( N log N ) time. A definition for the discrete fractional Fourier transform that emerges from our analysis is also discussed.
متن کاملA Novel Image Encryption Scheme based on Multiple Parameter Discrete Fractional Fourier Transform
Security is one of the most challenging aspects in internet and Multimedia applications. Encryption is a process which is used to secure data. The Encryption algorithms and suitable transforms play a crucial role to form efficient security systems. In this regard the original information in the existing security system based on the fractional Fourier transform (FRFT) is protected by only a cert...
متن کامل